Sequent Automaton - a Model for Logical Control
نویسندگان
چکیده
Sequent automaton is an intermediate abstract model used on the way from representation of a desired behavior of some engineering system at the algorithmic level to the detailed description of a logical control device designed to provide this behavior, in terms of logic circuits. In this paper, there are regarded the problems of obtaining a sequent automaton from the preceding model of parallel automaton, its analysis and checking for correctness, the rules of equivalence transformations, finding a corresponding system of Boolean equations and synthesizing a logic circuit which implements the given sequent automaton.
منابع مشابه
Parallel Automaton and Its Hardware Implementation
Logical control devices are intended for maintaining proper interaction between components of complicated engineering complexes. In general case, they are asynchronous systems carrying out control for several processes proceeding in parallel. Their design begins with working out parallel algorithms for logical control (PALC). A formal language PRALU is suggested for that, as well as its standar...
متن کاملDecision Procedures for Intuitionistic Propositional Logic by Program Extraction
We present two constructive proofs of the decidability of in-tuitionistic propositional logic by simultaneously constructing either a counter{model or a derivation. From these proofs, we extract two programs which have a sequent as input and return a derivation or a counter{ model. The search tree of these algorithms is linearly bounded by the number of connectives of the input. Soundness of th...
متن کاملInductive Verification of Hybrid Automata with Strongest Postcondition Calculus
Safety verification of hybrid systems is a key technique in developing embedded systems that have a strong coupling with the physical environment. We propose an automated logical analytic method for verifying a class of hybrid automata. The problems are more general than those solved by the existing model checkers: our method can verify models with symbolic parameters and nonlinear equations as...
متن کاملSome remarks on lengths of propositional proofs
We survey the best known lower bounds on symbols and lines in Frege and extended Frege proofs. We prove that in minimum length sequent calculus proofs, no formula is generated twice or used twice on any single branch of the proof. We prove that the number of distinct subformulas in a minimum length Frege proof is linearly bounded by the number of lines. Depth d Frege proofs of m lines can be tr...
متن کاملSequent Calculi and Bidirectional Natural Deduction: On the Proper Basis of Proof-theoretic Semantics
Philosophical theories of logical reasoning are intrinsically related to formal models. This holds in particular of Dummett–Prawitz-style proof-theoretic semantics and calculi of natural deduction. Basic philosophical ideas of this semantic approach have a counterpart in the theory of natural deduction. For example, the “fundamental assumption” in Dummett’s theory of meaning (Dummett, 1991, p. ...
متن کامل